In F or M Ation Sear Ch Pr Ocess of Lawyer S: a Call F Or`ju St F or M E' in F or M Ation Ser Vices
نویسنده
چکیده
The study reported in this paper is part of a programme of ongoing research based on the model of the Information Search Process (ISP) developed in a series of prior studies by Kuhlthau. This study sought to gain a better understanding of the variety of tasks that involve lawyers as a particular group of information workers, how they use information to accomplish their work, and the role mediators play in their process of information seeking and use. F indings revealed that these lawyers frequently were involved in complex tasks that required a constructive process of interpreting, learning and creat ing. To accomplish these complex tasks, they preferred printed texts over computer databases primarily because computer databases required well-speci®ed requests and did not offer an option for examining a wide range of information at one time. These lawyers called for an act ive potential role for mediators in j̀ust for me’ services. J̀ust for me’ services would encompass designing systems to provide a wider range of access more compatible with the process of construction, applying and developing principles of classi®cation that would offer a more uniform system for organising and accessing ®les, and providing direction in ®ltering the overwhelming amount of information available on electronic resources.
منابع مشابه
Amitraz Poisoning; A case study
A m i t r a z, a n i ns e c t i c i d e /a ca ri c i de of the f o r m a m i d i n e p e st i c i d e s group, is a ? 2 a d r e n e r g i c ag on i st a nd of t he a m i d i ne c h e m i ca l f a m il y generally us e d to c o n t r ol animal e c top a r a s i t e s. Poisoning due to am i t r a z i s r a r e and character...
متن کاملOn (Semi-) Edge-primality of Graphs
Let $G= (V,E)$ be a $(p,q)$-graph. A bijection $f: Eto{1,2,3,ldots,q }$ is called an edge-prime labeling if for each edge $uv$ in $E$, we have $GCD(f^+(u),f^+(v))=1$ where $f^+(u) = sum_{uwin E} f(uw)$. Moreover, a bijection $f: Eto{1,2,3,ldots,q }$ is called a semi-edge-prime labeling if for each edge $uv$ in $E$, we have $GCD(f^+(u),f^+(v))=1$ or $f^+(u)=f^+(v)$. A graph that admits an ...
متن کاملLabeling Subgraph Embeddings and Cordiality of Graphs
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, a vertex labeling $f : V(G)rightarrow mathbb{Z}_2$ induces an edge labeling $ f^{+} : E(G)rightarrow mathbb{Z}_2$ defined by $f^{+}(xy) = f(x) + f(y)$, for each edge $ xyin E(G)$. For each $i in mathbb{Z}_2$, let $ v_{f}(i)=|{u in V(G) : f(u) = i}|$ and $e_{f^+}(i)=|{xyin E(G) : f^{+}(xy) = i}|$. A vertex labeling $f$ of a graph $G...
متن کاملCenter--like subsets in rings with derivations or epimorphisms
We introduce center-like subsets Z*(R,f), Z**(R,f) and Z1(R,f), where R is a ring and f is a map from R to R. For f a derivation or a non-identity epimorphism and R a suitably-chosen prime or semiprime ring, we prove that these sets coincide with the center of R.
متن کاملMORE ON EDGE HYPER WIENER INDEX OF GRAPHS
Let G=(V(G),E(G)) be a simple connected graph with vertex set V(G) and edge set E(G). The (first) edge-hyper Wiener index of the graph G is defined as: $$WW_{e}(G)=sum_{{f,g}subseteq E(G)}(d_{e}(f,g|G)+d_{e}^{2}(f,g|G))=frac{1}{2}sum_{fin E(G)}(d_{e}(f|G)+d^{2}_{e}(f|G)),$$ where de(f,g|G) denotes the distance between the edges f=xy and g=uv in E(G) and de(f|G)=∑g€(G)de(f,g|G). In thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004